Lower Bounds for Testing Digraph Connectivity with One-Pass Streaming Algorithms
نویسندگان
چکیده
منابع مشابه
Lower bounds for testing digraph connectivity with one-pass streaming algorithms
In this note, we show that three graph properties strong connectivity, acyclicity, and reachability from a vertex s to all vertices each require a working memory of Ω( m) on a graph with m edges to be determined correctly with probability greater than (1 + )/2. In the streaming model of computation, the input is given as a sequence, or stream, of elements. There is no random access to the eleme...
متن کاملLower Bounds for Dynamic Connectivity
Our final goal here is to present a lower bound on the worst case time complexity of any data structure that solves this problem in the cell probe model of computation. The same idea, together with more careful analysis, can be used to establish a trade-off lower bound for this problem. For a data structure that solves dynamic connectivity (in cell probe model), assume the amortized update time...
متن کاملLower Bounds for Quantile Estimation in Random-Order and Multi-pass Streaming
We present lower bounds on the space required to estimate the quantiles of a stream of numerical values. Quantile estimation is perhaps the most studied problem in the data stream model and it is relatively well understood in the basic single-pass data stream model in which the values are ordered adversarially. Natural extensions of this basic model include the random-order model in which the v...
متن کاملStreaming Lower Bounds for Approximating MAX-CUT
We consider the problem of estimating the value of max cut in a graph in the streaming model of computation. At one extreme, there is a trivial 2-approximation for this problem that uses only O(log n) space, namely, count the number of edges and output half of this value as the estimate for max cut value. On the other extreme, if one allows Õ(n) space, then a near-optimal solution to the max cu...
متن کاملLower Bounds for Heuristic Algorithms
The constraint satisfaction problem, the Boolean satisfiability problem and the graph isomorphism problem do not have efficient algorithms. In order to solve these problems, one utilizes heuristic algorithms of polynomial running time. The present thesis studies three classical heuristics for the above-mentioned decision problems and answers the question whether they can be implemented more eff...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Letters of the Computer Society
سال: 2018
ISSN: 2573-9689
DOI: 10.1109/lcos.2018.2854761